package tree.binarysearchtree;

import tree.TreeNode;

/**
 * @Classname : TrimABinarySearchTree
 * @Description :
 * <a href="https://leetcode.cn/problems/trim-a-binary-search-tree/">669. 修剪二叉搜索树</a>
 * @Author : chentianyu
 * @Date 2023/1/13 22:30
 */


public class TrimABinarySearchTree {
    public TreeNode trimBST(TreeNode root, int low, int high) {
        if (root == null) return null;

        if (root.val < low) return trimBST(root.right, low, high);

        if (root.val > high) return trimBST(root.left, low, high);

        root.left = trimBST(root.left, low, high);
        root.right = trimBST(root.right, low, high);
        return root;
    }
}
